翻訳と辞書 Words near each other ・ Generalized polygon ・ Generalized processor sharing ・ Generalized Procrustes analysis ・ Generalized pustular psoriasis ・ Generalized quadrangle ・ Generalized quantifier ・ Generalized randomized block design ・ Generalized relative entropy ・ Generalized Riemann hypothesis ・ Generalized second-price auction ・ Generalized selection ・ Generalized semi-infinite programming ・ Generalized signal averaging ・ Generalized singular value decomposition ・ Generalized spectrogram ・ Generalized star height problem ・ Generalized suffix tree ・ Generalized symmetric group ・ Generalized System of Preferences ・ Generalized taxicab number ・ Generalized Timing Formula ・ Generalized Tobit ・ Generalized tree alignment ・ Generalized trichoepithelioma ・ Generalized trigonometry ・ Generalized TTL security mechanism ・ Generalized vaccinia ・ Generalized valence bond ・ Generalized vector space model ・ Generalized Verma module Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized star height problem ： ウィキペディア英語版 Generalized star height problem The generalized star-height problem in formal language theory is the open question whether all regular languages can be expressed using generalized regular expressions with a limited nesting depth of Kleene stars. Here, generalized regular expressions are defined like regular expressions, but they have a built-in complement operator. For a regular language, its generalized star height is defined as the minimum nesting depth of Kleene stars needed in order to describe the language by means of a generalized regular expression, hence the name of the problem. More specifically, it is an open question whether a nesting depth of more than 1 is required, and if so, whether there is an algorithm to determine the minimum required star height.〔Sakarovitch (2009) p.171〕 Regular languages of star-height 0 are also known as star-free languages. The theorem of Schützenberger provides an algebraic characterization of star-free languages by means of aperiodic syntactic monoids. In particular star-free languages are a proper decidable subclass of regular languages. == See also == * Eggan's theorem and Generalized star height sections of the Star height article * Star height problem 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized star height problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.